Random Hypergraph Irregularity

نویسندگان

  • Paul N. Balister
  • Béla Bollobás
  • Jenö Lehel
  • Michal Morayne
چکیده

A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is k-irregular.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How many random edges make a dense hypergraph non-2-colorable?

We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model for graphs has been started by Bohman et al. in [7], and continued in [8] and [16]. Here we obtain a tight bound on the number of random edges required to ensure non-2-colorability. We prove that for any k-uniform hypergr...

متن کامل

Vibration of Train-Rail-Bridge Interaction Considering Rail Irregularity with Arbitrary Wavelength

A generation method for the rail random irregularity with arbitrary wavelength interval (WI) is developed, and its accuracy and efficiency are demonstrated. Then a moving wheel-rail-bridge interaction element is derived to establish the finite element equations of motion for the train-rail-bridge interaction system, and the flow chart of assembly and calculation for the system equations is give...

متن کامل

Random Walks on Hypergraphs with Applications to Disease-Gene Prioritization

Typically, gene interaction networks are expressed as graphs, storing pairwise interactions between genes. Because of the vast amount of literature on statistical graph inference, this is a useful representation in practice. However, such a pairwise representation ignores more complex features of gene interactions, such as gene regulation and assembly. In this thesis, we propose a hypergraph mo...

متن کامل

Creation and Growth of Components in a Random Hypergraph Process

Denote by an l-component a connected b-uniform hypergraph with k edges and k(b− 1)− l vertices. We prove that the expected number of creations of l-component during a random hypergraph process tends to 1 as l and b tend to ∞ with the total number of vertices n such that l = o (

متن کامل

Random Preferential Attachment Hypergraphs

The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment evolution model than by the ordinary (uniform) evolution lodel. Analogously, this paper extends the random hypergraph model to a random preferential attachment ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2016